prime implicant table
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
Look at other dictionaries:
Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… … Wikipedia
Petrick's method — In Boolean algebra, Petrick s method (also known as the branch and bound method) is a technique for determining all minimum sum of products solutions from a prime implicant chart. Petrick s method is very tedious for large charts, but it is easy… … Wikipedia
Circuit minimization — In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean function or truth table. The general circuit minimization problem is believed to be intractable,… … Wikipedia
List of Boolean algebra topics — This is a list of topics around Boolean algebra and propositional logic. Contents 1 Articles with a wide scope and introductions 2 Boolean functions and connectives 3 Examples of Boolean algebras … Wikipedia